OPTIMALITY AND PARAMETRIC DUALITY FOR NONSMOOTH MINIMAX FRACTIONAL PROGRAMMING PROBLEMS INVOLVING L-INVEX-INFINE FUNCTIONS
نویسندگان
چکیده
منابع مشابه
Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملOptimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions
1 Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia 2 Department of Mathematical Sciences, Florida Institute of Techynology, Melbourne 32901, USA 3 Department of Mathematics, Aligarh Muslim University, Aligarh-202 002, India 4 Department of Mathematics, Faculty of Applied Sciences, Integral University, Lucknow 226026, India 5 D...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملDuality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,ρ,d)-Convexity
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,ρ,d)-convexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2016
ISSN: 0101-7438
DOI: 10.1590/0101-7438.2016.036.02.0227